Pii: S0031-3203(01)00132-7
نویسندگان
چکیده
k-nearest neighbor (k-NN) classi"cation is a well-known decision rule that is widely used in pattern classi"cation. However, the traditional implementation of this method is computationally expensive. In this paper we develop two e5ective techniques, namely, template condensing and preprocessing, to signi"cantly speed up k-NN classi"cation while maintaining the level of accuracy. Our template condensing technique aims at “sparsifying” dense homogeneous clusters of prototypes of any single class. This is implemented by iteratively eliminating patterns which exhibit high attractive capacities. Our preprocessing technique "lters a large portion of prototypes which are unlikely to match against the unknown pattern. This again accelerates the classi"cation procedure considerably, especially in cases where the dimensionality of the feature space is high. One of our case studies shows that the incorporation of these two techniques to k-NN rule achieves a seven-fold speed-up without sacri"cing accuracy. ? 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
منابع مشابه
Robust Hausdorff distance matching algorithms using pyramidal structures
This paper proposes two Hausdor! distance (HD) matching algorithms, in which robust HD measures are implemented in pyramidal structures. By computer simulations, the matching performance of the conventional HD measures and the proposed robust HD matching algorithms using pyramidal structures is compared, with real images which are degraded by noise and occlusions. 2001 Pattern Recognition Socie...
متن کاملPii: S0031-3203(01)00129-7
This paper presents a survey on o!-line Cursive Word Recognition. The approaches to the problem are described in detail. Each step of the process leading from raw data to the /nal result is analyzed. This survey is divided into two parts, the /rst one dealing with the general aspects of Cursive Word Recognition, the second one focusing on the applications presented in the literature. ? 2002 Pat...
متن کاملGaussian mixture parameter estimation with known means and unknown class-dependent variances
متن کامل
Visual Segment Tree Creation for MPEG-7 Description Schemes
This paper deals with the creation of visual segment trees involved in MPEG-7 Description Schemes. After a brief overview of MPEG7 description schemes in general and of the Segment Description Scheme in particular, tools allowing the creation of segment trees are discussed. It is proposed to create a Binary Partition Tree in a first step and to restructure the tree in a second step. Several exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002